Optimizing Optimal -calculus Implementations

In As94], a correspondence between Lamping-Gonthier's operators for Optimal Reduction of the-calculus Lam90, GAL92a] and the operations associated with the comonad \!" of Linear Logic was established. In this paper, we put this analogy at work, adding new rewriting rules directly suggested by the categorical equations of the comonad. These rules produce an impressive improvement of the performance of the reduction system, and provide a rst step towards the solution of the well known and crucial problem of accumulation of control operators.